ERA + GA: A Method for Solving SAT Instances
نویسندگان
چکیده
A method for solving satisfiability (SAT) instances is presented. It is based on two basic components: An Epistasis Reducer Algorithm (ERA) and a simple Genetic Algorithm (GA). ERA is implemented by a simulated annealing algorithm (SA), which preprocess the original SAT problem by rearranging the variables to satisfy the condition that the most related ones are in closer positions inside the chromosome, and in this way produce a more suited representation for a GA. Then a simple GA is used to solve the preprocessed SAT instances. The Results of experimentation demonstrated that the proposed combined approach outperforms a simple GA in all the tests accomplished. Key-Words: Genetic Algorithms, Epistasis, Satisfiability.
منابع مشابه
SAT Solving Using an Epistasis Reducer Algorithm plus a GA
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited representation (with lower epistasis) for a Genetic Algorithm (GA) by preprocessing the original SAT problem; and b) A Genetic Algorithm that solves the preprocessed instances. ERA is implemented by a simulated annealing algo...
متن کاملERA: An Algorithm for Reducing the Epistasis of SAT Problems
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited representation (with lower epistasis) for a Genetic Algorithm (GA) by preprocessing the original SAT problem; and b) A Genetic Algorithm that solves the preprocesed instances. ERA is implemented by a simulated annealing algor...
متن کاملSolving Difficult SAT Instances Using Greedy Clique Decomposition
We are dealing with solving difficult SAT instances in this paper. We propose a method for preprocessing SAT instances (CNF formulas) by using consistency techniques known from constraint programming methodology and by using our own consistency technique based on clique decomposition of a graph representing conflicts in the input formula. The clique decomposition allows us to make a strong reas...
متن کاملSystematic versus Local Search and GA Techniques for Incremental SAT
Propositional satisfiability (SAT) problem is fundamental to the theory of NP-completeness. Indeed, using the concept of ”polynomial-time reducibility” all NP-complete problems can be polynomially reduced to SAT. Thus, any new technique for satisfiability problems will lead to general approaches for thousands of hard combinatorial problems. In this paper, we introduce the incremental propositio...
متن کاملUsing Monte Carlo Method for Searching Partitionings of Hard Variants of Boolean Satisfiability Problem
In this paper we propose the approach for constructing partitionings of hard variants of the Boolean satisfiability problem (SAT). Such partitionings can be used for solving corresponding SAT instances in parallel. For the same SAT instance one can construct different partitionings, each of them is a set of simplified versions of the original SAT instance. The effectiveness of an arbitrary part...
متن کامل